Experimental Study of the Shortest Reset Word of Random Automata
نویسندگان
چکیده
In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing automaton. The largest automata we considered had 100 states. The results of the experiments allow us to formulate a hypothesis that the length of the shortest reset word of a random finite automaton with n states and 2 input letters with high probability is sublinear with respect to n and can be estimated as 1.95n .
منابع مشابه
A Fast Algorithm Finding the Shortest Reset Words
In this paper we present a new fast algorithm finding minimal reset words for finite synchronizing automata. The problem is know to be computationally hard, and our algorithm is exponential. Yet, it is faster than the algorithms used so far and it works well in practice. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare resulted subsets. We give both th...
متن کاملComputing the shortest reset words of synchronizing automata
In this paper we give the details of our new algorithm for finding minimal reset words of finite synchronizing automata. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare su...
متن کاملThe Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish member...
متن کاملThe \v{C}ern\'{y} conjecture for small automata: experimental report
We present a report from a series of experiments involving computation of the shortest reset words for automata with small number of states. We confirm that the Černý conjecture is true for all automata with at most 11 states on 2 letters. Also some new interesting results were obtained, including the third gap in the distribution of the shortest reset words and new slowly synchronizing classes...
متن کاملNotable trends concerning the synchronization of graphs and automata
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Černy had found in 1964 a sequence of n-state complete DFA with shortest synchronizing word of length (n− 1). He had conjectured that it is an upper bound for the length of the shortest synchronizing word for any n-state compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011